std::set
From Cppreference
| C++ Standard Library | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| Containers library | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| std::set | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Defined in header <set>
|
||
| template<
class Key, |
||
Set is an associative container that contains a sorted set of unique objects of type Key. Sorting is done using the key comparison function Compare.
Contents |
[edit] Member types
| Member type | Definition |
| key_type | Key |
| value_type | Key |
| size_type | Unsigned integral type (usually size_t) |
| difference_type | Signed integer type (usually ptrdiff_t) |
| key_compare | Compare |
| value_compare | Compare |
| allocator_type | Allocator |
| reference | Allocator::reference (pre-C++11 version) value_type& (C++11 version) |
| const_reference | Allocator::const_reference (pre-C++11 version) const value_type& (C++11 version) |
| pointer | T* (pre-C++11 version) std::allocator_traits<Allocator>::pointer (C++11 version) |
| const_pointer | const T* (pre-C++11 version) std::allocator_traits<Allocator>::const_pointer (C++11 version) |
| iterator | Bidirectional iterator |
| const_iterator | Constant bidirectional iterator |
reverse_iterator
|
std::reverse_iterator<iterator> |
const_reverse_iterator
|
std::reverse_iterator<const_iterator> |
[edit] Member functions
|
constructs the set (public member function) |
||
|
destructs the set (public member function) |
||
|
assigns values to the container (public member function) |
||
|
returns the associated allocator (public member function) |
||
Iterators | |||
|
returns an iterator to the beginning (public member function) |
||
|
returns an iterator to the end (public member function) |
||
|
returns a reverse iterator to the beginning (public member function) |
||
|
returns a reverse iterator to the end (public member function) |
||
Capacity | |||
|
checks whether the container is empty (public member function) |
||
|
returns the number of elements (public member function) |
||
|
returns the maximum possible number of elements (public member function) |
||
Modifiers | |||
|
clears the contents (public member function) |
||
|
inserts elements (public member function) |
||
|
constructs element in-place (public member function) |
||
|
constructs elements in-place using a hint (public member function) |
||
|
erases elements (public member function) |
||
|
swaps the contents (public member function) |
||
Lookup | |||
|
returns the number of elements matching specific key (public member function) |
||
|
finds element with specific key (public member function) |
||
|
returns range of elements matching a specific key (public member function) |
||
|
returns an iterator to the first element not less than the given value (public member function) |
||
|
returns an iterator to the first element greater than a certain value (public member function) |
||
Observers | |||
|
returns the function that compares keys (public member function) |
||
|
returns the function that compares keys (public member function) |
||
[edit] Non-member functions
|
lexicographically compares the values in the container (function) |
|
|
specializes the std::swap() algorithm (function template) |
|